cient Primes for Discrete Log
نویسندگان
چکیده
This paper presents a method for generating prime moduli with a special form which can simplify the modular reduction process and reduce the storage requirement. Such moduli will be particularly useful for implementing discrete log cryptosystems under the environment with limited computing and storage resources.
منابع مشابه
Computing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...
متن کاملDesigning and Detecting Trapdoors for Discrete Log Cryptosystems
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cryptosystems, such as the Digital Signature Standard. This paper discusses the practical impact of these trapdoors, and how to avoid them.
متن کاملA Statistical Limited-knowledge Proof for Secure Rsa Keys
The underlying cryptographic security of a number of public key cryptographic protocols rests upon the diiculty of factoring large composite integers. The RSA system is one such example. Given current state of the art factoring algorithms, an integer which is the product of a limited number of primes is most diicult to factor when the primes are nearly equal. A zero knowledge proof that a numbe...
متن کاملFactoring Integers and Computing Discrete Logarithms via Diophantine Approximations
Let N be an integer with at least two distinct prime factors. We reduce the problem of factoring N to the task of nding t + 2 integer solutions (e1; : : : ; et) 2 ZZ t of the inequalities t X i=1 ei log pi ? log N N ?c p o(1) t t X i=1 jei log pij (2c ? 1) log N + 2 log pt; where c > 1 is xed and p1; : : : ; pt are the rst t primes. We show, under a reasonable hypothesis, that there are N "+o(1...
متن کاملMinimax Estimator of a Lower Bounded Parameter of a Discrete Distribution under a Squared Log Error Loss Function
The problem of estimating the parameter ?, when it is restricted to an interval of the form , in a class of discrete distributions, including Binomial Negative Binomial discrete Weibull and etc., is considered. We give necessary and sufficient conditions for which the Bayes estimator of with respect to a two points boundary supported prior is minimax under squared log error loss function....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007